Towards decentralised job shop scheduling as a web service

نویسندگان

چکیده

This paper aims to investigate the fundamental requirements for a cloud-based scheduling service manufacturing, notably manufacturer priority service, resolution of schedule conflict, and error-proof data entry. A flow chart an inference-based system manufacturing is proposed prototype was designed using semantic web technologies. An adapted version Muth Thompson 10 × problem (MT10) used as case study two companies represented our use cases. Using Microsoft Project, levelled operation plans were generated. Semantic rules constraints calculation, verification. Pellet reasoner apply those onto study. The results include main findings. First, effectively detected conflicts when subjected four types disturbances. Secondly, suggestions conflict resolutions effective implemented albeit they not efficient. Consequently, hypotheses accepted which gave merit future works intended develop service. Future will three phases: (1) migration graph database server, (2) multi-agent automate entry, (3) optimisation mechanism prioritisation services.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Job-shop scheduling in a body shop

We study a generalized job-shop problem called the body shop scheduling problem (BSSP). This problem arises from the industrial application of welding in a car body production line, where possible collisions between industrial robots have to be taken into account. BSSP corresponds to a job-shop problem where the operations of a job have to follow alternating routes on the machines, certain oper...

متن کامل

Maximizing service level in a β-robust job shop scheduling model

In the realm of scheduling problems, different sources of uncertainty such as probabilistic durations of jobs or stochastic breakdowns of machines can arise. Given this, one highly desirable characteristic of an intelligent schedule is to bring better punctuality with less efficiency-loss because a dominant factor in customer appreciation is punctuality. It is also one of the most intangible to...

متن کامل

Job-shop scheduling

The n×m minimum-makespan general job-shop scheduling problem, hereafter referred to as the JSSP, can be described by a set of n jobs {Ji}1≤j≤n which is to be processed on a set of m machines {Mr}1≤r≤m. Each job has a technological sequence of machines to be processed. The processing of job Jj on machine Mr is called the operation Ojr. Operation Ojr requires the exclusive use of Mr for an uninte...

متن کامل

Hybrid job shop scheduling

We consider the problem of scheduling jobs in a hybrid job shop We use the term hybrid to indicate that we consider a lot of extensions of the classic job shop such as transportation times multiple resources and setup times The Shifting Bottleneck procedure can be generalized to deal with those extensions We test this approach for an assembly shop In this shop we study the in uence of static an...

متن کامل

Towards Implementing Reactive Scheduling for Job Shop Problem

Most of the research literature concerning scheduling concentrates on the static problems, i.e problems where all input data is known and does not change over time. However, the real world scheduling problems are very seldom static. Events like machine breakdown or bottleneck in some situation impossible to predict. Dynamic scheduling is a research field, which take into consideration uncertain...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Cogent engineering

سال: 2021

ISSN: ['2331-1916']

DOI: https://doi.org/10.1080/23311916.2021.1938795